Conflicting Agents in Distributed Search
نویسنده
چکیده
We extend here the work on interleaved distributed graph based backjumping, IDIBT/GBJ 7,6,5 by considering conflicting agents . The resulting method IDIBT/CBJ-DkC for Conflict-directed BackJumbing and Directed k-Consistency combines distributed and parallel explorations of search spaces with more efficient backtrack steps. We take advantage of the asynchronous framework to implement a more refined and efficient update of conflicts. A fine analysis of these conflicts allows to some extent the detection of k-inconsistent values. Our experiments show a large improvement over graph based distributed/interleaved search.
منابع مشابه
A Hybrid MOEA/D-TS for Solving Multi-Objective Problems
In many real-world applications, various optimization problems with conflicting objectives are very common. In this paper we employ Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), a newly developed method, beside Tabu Search (TS) accompaniment to achieve a new manner for solving multi-objective optimization problems (MOPs) with two or three conflicting objectives. This i...
متن کاملSolving Conflicting Beliefs with a Distributed Belief Revision Approach
The ability to solve conflicting beliefs is crucial for multiagent systems where the information is dynamic, incomplete, and distributed over a group of individuals. The individual agents have partial views and, frequently, hold disparate beliefs regarding shared information. The nature of these conflicts is dynamic and requires adequate methodologies for dynamic conflict resolution. The propos...
متن کاملRetractable Contract Network for Distributed Scheduling
This paper is about distributed scheduling where individual agents have potentially conflicting interests. It is motivated by BT’s workforce scheduling problem, where multiple service providers have to serve multiple service buyers. The service providers and buyers all attempt to maximize their own utility. The overall problem is a multi-objective optimization problem; for example, one has to m...
متن کاملParallel Proposals in Asynchronous Search
Parallelism and distribution are two distinct concepts that are confusingly close. Parallel Search refers in this work to the distribution of the search space and Distributed Asynchronous Search to the distribution of the constraint predicates. A certain amount of parallelism exists in any Distributed Asynchronous Search and it increases with the degree of asynchronism. However, in comparison t...
متن کاملDistributed Configuration as Distributed Dynamic Constraint Satisfaction
Dynamic constraint satisfaction problem (DCSP) solving is one of the most important methods for solving various kinds of synthesis tasks, such as configuration. Todays configurators are standalone systems not supporting distributed configuration problem solving functionality. However, supply chain integration of configurable products requires the integration of configuration systems of differen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- International Journal on Artificial Intelligence Tools
دوره 14 شماره
صفحات -
تاریخ انتشار 2005